Best approximation by continuous n-convex functions

Best approximation by integer-valued functions

Given an integer function f , the problem is to find its best uniform approximation from a set K of integervalued bounded functions. Under certain conditions on K , the best extremal (maximal or minimal) approximation is identified. Furthermore, the operator mapping f to its extremal best approximation is shown to be Lipschitzian with some constant C or optimal Lipschitzian having the smallest ...

Fuzzy Best Simultaneous Approximation of a Finite Numbers of Functions

Fuzzy best simultaneous approximation of a finite number of functions is considered. For this purpose, a fuzzy norm on $Cleft (X, Y right )$ and its fuzzy dual space and also the  set of subgradients of a fuzzy norm are introduced. Necessary case of a proved theorem about characterization of simultaneous approximation will be extended to the fuzzy case.

Minimizing Convex Functions by Continuous Descent Methods

We study continuous descent methods for minimizing convex functions, defined on general Banach spaces, which are associated with an appropriate complete metric space of vector fields. We show that there exists an everywhere dense open set in this space of vector fields such that each of its elements generates strongly convergent trajectories.

Best approximation by closed unit balls

We obtain a sucint and nesessery theoreoms simple for compactness andweakly compactness of the best approximate sets by closed unit balls. Also weconsider relations Kadec-Klee property and shur property with this objects.These theorems are extend of papers mohebi and Narayana.

Of Approximation by Polynomials to Continuous Functions